LDPC codes from the Hermitian curve
نویسنده
چکیده
Amongst the contributions to the theory of LDPC codes deriving from finite geometries ([13], [12], [9]), we present a study of the code C which has as parity-check matrix H the incidence matrix of the Hermitian curve of PG(2, q) and the q + 1-secant to it. The good performance of C with iterative decoding algorithm is showed by Johnson and Weller in [11]. In this paper we prove the ”double” cyclic structure of C, we shorten H in a suitable way in order to obtain new codes and show how in some cases we have a gain in the code-rate; finally we present a geometric approach to easily construct the matrix H.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملWeierstrass Semigroups and Codes from a Quotient of the Hermitian Curve
We consider the quotient of the Hermitian curve defined by the equation yq + y = xm over Fq2 where m > 2 is a divisor of q + 1. For 2 ≤ r ≤ q + 1, we determine the Weierstrass semigroup of any r-tuple of Fq2 rational points (P∞, P0b2 , . . . , P0br ) on this curve. Using these semigroups, we construct algebraic geometry codes with minimum distance exceeding the designed distance. In addition, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 42 شماره
صفحات -
تاریخ انتشار 2007